{"componentChunkName":"component---src-templates-post-jsx","path":"/[BOJ]16172/","result":{"data":{"site":{"siteMetadata":{"title":"SUbbb"}},"markdownRemark":{"id":"7ca89240-c65f-5cb4-aeef-c5f1605ebd00","excerpt":"문제 BOJ - 나는 친구가 적다(Large) 📍 Logic 📄 CODE ✏️ Review 정규표현식으로 접근했다가 엄청난 시간초과를 맞닥뜨려 무슨 알고리즘을 쓰는지 봤다. KMP 알고리즘은 잘 이해하지 못해서 후에 다시 이해한 후에 로직을 적어봐야 할 것 같다.","html":"<h2>문제</h2>\n<p><a href=\"https://www.acmicpc.net/problem/16172\">BOJ - 나는 친구가 적다(Large)</a></p>\n<h3>📍 <strong>Logic</strong></h3>\n<deckgo-highlight-code language=\"java\" terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\"></code>\n        </deckgo-highlight-code>\n<ul>\n<li></li>\n</ul>\n<h3>📄 <strong>CODE</strong></h3>\n<details>\n  <summary>코드 보기/접기💫</summary>\n    <div markdown=\"1\">\n<deckgo-highlight-code  terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">import java.io.*;\nimport java.util.Stack;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\nclass Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n        String book = br.readLine().replaceAll(&quot;\\\\d&quot;, &quot;&quot;);\n        String keyword = br.readLine();\n\n        System.out.println(KMP(book, keyword) ? 1 : 0);\n    }\n\n    public static int[] computeTable(String book) {\n        int n = book.length();\n        int[] table = new int[n];\n\n        int idx = 0;\n        for (int i = 1; i &lt; n; i++) {\n            // 문자가 일치하면, 연속적으로 일치할 때까지 탐색\n            // 일치하지 않는 경우 이전 idx의 table값을 idx로\n            while (idx &gt; 0 &amp;&amp; book.charAt(i) != book.charAt(idx))\n                idx = table[idx - 1];\n\n            if (book.charAt(i) == book.charAt(idx)) {\n                idx += 1;\n                table[i] = idx;\n            }\n        }\n        return table;\n    }\n\n    public static boolean KMP(String book, String keyword) {\n        int n1 = book.length();\n        int n2 = keyword.length();\n\n        int[] table = computeTable(book);\n\n        boolean found = false;\n\n        int idx = 0; // 현재 대응되는 글자 수\n        for(int i = 0; i &lt; n1; i++) {\n            // 키워드의 idx번 글자와 교과서의 해당 글자가 불일치할 경우,\n            // 현재 대응된 글자의 수를 table[idx-1]번으로 줄인다.\n            while (idx &gt; 0 &amp;&amp; book.charAt(i) != keyword.charAt(idx))\n                idx = table[idx - 1];\n\n            // 글자가 대응될 경우\n            if (book.charAt(i) == keyword.charAt(idx)) {\n                if (idx == n2 - 1) {\n                    found = true;\n                    break;\n                } else\n                    idx += 1;\n            }\n        }\n\n        return found;\n    }\n}</code>\n        </deckgo-highlight-code>\n  \t</div>\n</details>\n<h3>✏️ <strong>Review</strong></h3>\n<ul>\n<li>정규표현식으로 접근했다가 엄청난 시간초과를 맞닥뜨려 무슨 알고리즘을 쓰는지 봤다.</li>\n<li>KMP 알고리즘은 잘 이해하지 못해서 후에 다시 이해한 후에 로직을 적어봐야 할 것 같다.</li>\n</ul>","frontmatter":{"title":"👩‍💻 16172. 나는 친구가 적다(Large)","date":"May 28, 2022","update":"May 28, 2022","tags":["문자열","KMP"],"series":"👩‍💻 BOJ"},"fields":{"slug":"/[BOJ]16172/","readingTime":{"minutes":1.92}}},"seriesList":{"edges":[{"node":{"id":"27733333-3aad-5771-a1a1-27b4de4b4a01","fields":{"slug":"/[BOJ]2225/"},"frontmatter":{"title":"👩‍💻 2225. 합분해"}}},{"node":{"id":"548ba188-2afe-5575-b79f-107c6c65b07d","fields":{"slug":"/[BOJ]1012/"},"frontmatter":{"title":"👩‍💻 1012. 유기농 배추"}}},{"node":{"id":"0c712680-130f-5fa5-8c3b-3632dd5d1af0","fields":{"slug":"/[BOJ]1260/"},"frontmatter":{"title":"👩‍💻 1260. DFS와 BFS"}}},{"node":{"id":"0e07a592-06ce-5e01-b5e1-95398330372e","fields":{"slug":"/[BOJ]1707/"},"frontmatter":{"title":"👩‍💻 1707. 이분그래프"}}},{"node":{"id":"df12bfec-ed5c-5fc4-8442-0a4b3f9759a3","fields":{"slug":"/[BOJ]2668/"},"frontmatter":{"title":"👩‍💻 2668. 숫자 고르기"}}},{"node":{"id":"01bbb6dc-812c-5223-87c5-53bf04c0d0a6","fields":{"slug":"/[BOJ]9466/"},"frontmatter":{"title":"👩‍💻 9466. 텀 프로젝트"}}},{"node":{"id":"abc306b3-c3a6-552a-8979-e82d506b3921","fields":{"slug":"/[BOJ]2146/"},"frontmatter":{"title":"👩‍💻 2146. 다리 만들기"}}},{"node":{"id":"b3394e53-5e9a-595e-8da4-bb3debd220c0","fields":{"slug":"/[BOJ]5014/"},"frontmatter":{"title":"👩‍💻 5014. 스타트 링크"}}},{"node":{"id":"be297703-e778-5727-8019-6954bc95da3a","fields":{"slug":"/[BOJ]11559/"},"frontmatter":{"title":"👩‍💻 11559. Puyo Puyo"}}},{"node":{"id":"ddf11545-d468-5269-94b1-5daa2720e886","fields":{"slug":"/[BOJ]17471/"},"frontmatter":{"title":"👩‍💻 17471. 게리맨더링"}}},{"node":{"id":"8d77114d-fc6e-5de2-a3ca-c3b250425a56","fields":{"slug":"/[BOJ]2437/"},"frontmatter":{"title":"👩‍💻 2437. 저울"}}},{"node":{"id":"9a8942ce-552f-51ae-b304-0d0fab8f2eba","fields":{"slug":"/[BOJ]14891/"},"frontmatter":{"title":"👩‍💻 14891. 톱니바퀴"}}},{"node":{"id":"f1c04e8a-df0a-5294-949f-5f3a483cbcb0","fields":{"slug":"/[BOJ]14503/"},"frontmatter":{"title":"👩‍💻 14503. 로봇 청소기"}}},{"node":{"id":"883b6ecf-7528-5c16-92fa-edf12a64e80e","fields":{"slug":"/[BOJ]3190/"},"frontmatter":{"title":"👩‍💻 3190. 뱀"}}},{"node":{"id":"099b2576-7d05-5872-a9f0-f1ee6efd3a9a","fields":{"slug":"/[BOJ]14502/"},"frontmatter":{"title":"👩‍💻 14502. 연구소"}}},{"node":{"id":"50eef059-4e55-5f14-a9cf-fb01b6506f02","fields":{"slug":"/[BOJ]17779/"},"frontmatter":{"title":"👩‍💻 17779. 게리맨더링 2"}}},{"node":{"id":"aa67d90b-4801-574c-b225-56c23737a5e2","fields":{"slug":"/[BOJ]2579/"},"frontmatter":{"title":"👩‍💻 2579. 계단 오르기"}}},{"node":{"id":"9db6b43b-963a-5ebd-b72b-69936cf37858","fields":{"slug":"/[BOJ]14499/"},"frontmatter":{"title":"👩‍💻 14499. 주사위 굴리기"}}},{"node":{"id":"6a79cddd-dc1b-5e34-8a84-af313c37de0e","fields":{"slug":"/[BOJ]15685/"},"frontmatter":{"title":"👩‍💻 15685. 드래곤 커브"}}},{"node":{"id":"5e001d34-d985-545b-83ec-7f1c7caea286","fields":{"slug":"/[BOJ]17144/"},"frontmatter":{"title":"👩‍💻 17144. 미세먼지 안녕!"}}},{"node":{"id":"1d132410-9377-5e55-85b9-4664ff64de73","fields":{"slug":"/[BOJ]9935/"},"frontmatter":{"title":"👩‍💻 9935. 문자열 폭발"}}},{"node":{"id":"e13ff8d6-9b02-56c0-83e2-1d3144f70e1d","fields":{"slug":"/[BOJ]16472/"},"frontmatter":{"title":"👩‍💻 16472. 고냥이"}}},{"node":{"id":"0f782160-aaa9-5c54-80c0-72a15172dd16","fields":{"slug":"/[BOJ]1083/"},"frontmatter":{"title":"👩‍💻 1083. 소트"}}},{"node":{"id":"fef58615-9e18-5f50-8d09-3d1e2839342f","fields":{"slug":"/[BOJ]20922/"},"frontmatter":{"title":"👩‍💻 20922. 겹치는 건 싫어"}}},{"node":{"id":"7ca89240-c65f-5cb4-aeef-c5f1605ebd00","fields":{"slug":"/[BOJ]16172/"},"frontmatter":{"title":"👩‍💻 16172. 나는 친구가 적다(Large)"}}}]},"previous":{"fields":{"slug":"/[CS]이진탐색트리/"},"frontmatter":{"title":"📂 이진탐색트리(Binary Search Tree)"}},"next":{"fields":{"slug":"/[CS]HashMap동작방식/"},"frontmatter":{"title":"📂 HashMap 동작방식"}}},"pageContext":{"id":"7ca89240-c65f-5cb4-aeef-c5f1605ebd00","series":"👩‍💻 BOJ","previousPostId":"2efb6036-05bf-594e-b9b5-03e399be6f78","nextPostId":"da3b5248-1d87-5d2e-8059-8d48fba73571"}},"staticQueryHashes":[]}